Dominating weakly connected set dominating bridge independent graphs
نویسندگان
چکیده
منابع مشابه
Clustering wireless ad hoc networks with weakly connected dominating set
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clustering protocol for constructing virtual backbone is becoming one of the most important issues in wireless ad hoc networks. The weakly connected dominating set (WCDS) is very suitable for cluster formation. As finding th...
متن کاملOn connected dominating set games †
Many authors studied cooperative games that arise from variants of dominating set games on graphs. In wireless networks, the connected dominating set is used to reduce routing table size and communication cost. In this paper, we introduce a connected dominating set game to model the cost allocation problem arising from a connected dominating set on a given graph and study its core. In addition,...
متن کاملLearning Automata-Based Algorithms for Finding Minimum Weakly Connected Dominating Set in Stochastic Graphs
A weakly connected dominating set (WCDS) of graph is a subset of so that the vertex set of the given subset and all vertices with at least one endpoint in the subset induce a connected sub‐graph of . Finding the WCDS is a new promising approach for clustering the wireless networks. The minimum WCDS (MWCDS) problem is known to be NP‐hard, and several approximation algo...
متن کاملOn minimum connected dominating set problem in unit-ball graphs
Given a graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D such that its induced subgraph is connected and each vertex outside D has at least one neighbor in D. Approximations of minimum connected dominating sets are often used to represent a virtual routing backbone in wireless networks. This paper proposes a constant-ratio approximation a...
متن کاملA characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set
Let G be a connected graph with vertex set V (G). A set S of vertices in G is called a weakly connected dominating set of G if (i) S is a dominating set of G and (ii) the graph obtained from G by removing all edges joining two vertices in V (G) \ S is connected. A weakly connected dominating set S of G is said to be minimum or a γw-set if |S| is minimum among all weakly connected dominating set...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Malaya Journal of Matematik
سال: 2019
ISSN: 2319-3786,2321-5666
DOI: 10.26637/mjm0s01/0002